1 Cyran.rtf
نویسنده
چکیده
The paper focuses on problems which arise when two different types of AI methods are combined in one design. The first type is rule based, rough set methodology operating is highly discretized attribute space. The discretization is a consequence of the granular nature of knowledge representation in the theory of rough sets. The second type is neural network working in continuous space. Problems of combining these different types of knowledge processing are illustrated in a system used for recognition of diffraction patterns. The feature extraction is performed with the use of holographic ring wedge detector, generating the continuous feature space. No doubt, this is a feature space natural for application of the neural network. However, the criterion of optimization of the feature extractor uses rough set based knowledge representation. This latter, requires the discretization of conditional attributes generating the feature space. The novel enhanced method of optimization of holographic ring wedge detector is proposed, as a result of modification of indiscernibility relation in the theory of rough sets.
منابع مشابه
DIGITAL EXCLUSION AMEND.indd
0 0 1 1 0 1 0 1 0 1 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 1 1 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 1 0 1 0 1 1 1 0 0 1 0 1 0 1 0 1 0 1 1 0 0 1 1 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 1 1 1 0 0 1 0 1 0 1 0 0 1 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 0 1 0 0 1 1 1 0 0 0 1 1 0 0 0 1 0 1 0 1 0 0 1 1 1 0 0 1 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1...
متن کاملConditional and unconditional infectiousness effects in vaccine trials.
[ ] [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ), 1 ) 1 ( Pr 1 ) 0 ( , 1 ) 1 ( | ) 1 , ( E 0 ) 0 ( , 0 ) 1 ( Pr 0 ) 0 ( , 0 ) 1 ( | ) 0 , ( E 1 ) 0 ( , 0 ) 1 ( Pr 1 ) 0 ( , 0 ) 1 ( | ) 0 , ( E 1 ) 0 ( , 1 ) 1 ( Pr 1 ) 0 ( , 1 ) 1 ( | ) 1 , ( E 0 ) 0 ( , 0 ) 1 ( Pr 0 ) 0 ( , 0 ) 1 ( | )) 1 ( , ( E 1 ) 0 ( , 0 ) 1 ( Pr 1 ) 0 ( , 0 ) 1 ( | )) 1 ( , ( E 1 ) 0 ( , 1 ) 1 ( Pr 1 ) 0...
متن کاملComputational Appendix: Hamilton Decompositions of 6-regular Cayley Graphs on Even Abelian Groups with Involution-free Connection Sets
Z2 ⊕ Z12 {(1, 4), (1, 5), (0, 3)}, {(1, 3), (1, 4), (0, 3)}, {(0, 1), (0, 2), (1, 1)}, {(1, 3), (0, 4), (1, 2)}, {(1, 3), (1, 5), (0, 3)}, {(0, 4), (0, 5), (1, 2)}, {(0, 2), (1, 5), (1, 2)}, {(1, 3), (0, 1), (1, 5)}, {(0, 1), (0, 3), (1, 2)}, {(1, 3), (0, 1), (0, 4)}, {(0, 2), (0, 3), (1, 2)}, {(1, 4), (1, 1), (1, 2)}, {(1, 4), (1, 5), (0, 5)}, {(1, 3), (0, 1), (0, 5)}, {(0, 2), (0, 3), (1, 1)}...
متن کاملGeneralized Gorshkov-Wirsing Polynomials and the Integer Chebyshev Problem
Interval LLL SIMPLEX HS Amoroso Lower # CP [-1, 1] 1/1.5314 1/1.5334 1/1.4772 1/1.4520 1/1.5417 8 [-1/2, 1/2] 1/2.3559 1/2.3619 1/2.1822 1/1.4520 1/2.3768 9 [-1/3, 1/3] 1/3.2522 1/3.2617 1/3.0000 1/1.3887 1/3.2842 7 [-2/3, 2/3] 1/1.8820 1/1.8883 1/1.7237 1/1.3887 1/1.9845 5 [-1/4, 1/4] 1/4.1921 1/4.2025 1/4.0000 1/1.1097 1/4.2260 6 [-3/4, 3/4] 1/1.7897 1/1.7935 1/1.7237 1/1.1097 1/1.9653 3 [-1/...
متن کامل4.3 Modiied Variants and Weaknesses 4 the Attack on Lucifer 3 Conditional Characteristics
Round output diierence input diierence p icb key fraction P = (f7g; 0) 1 A = 0 a = 0 1 1 2 B = f45g b = f7g p = 1=8 0 1/2 3 C = f6g c = f45g p = 1=8 1 1/2 4 f45g f6; 7g p = 1=8 0 1/2 5 0 0 1 1 6 f45g f6; 7g p = 1=8 0 1/2 7 f6g f45g p = 1=8 1 1/2 8 f45g f7g p = 1=8 0 1/2 9 0 0 1 1 8 f39g f7g p = 1=8 1 1/2 9 f7g f39g p = 1=8 1 1/2 T = (0; f39g) 17 ent fractions of the key space. Round output diie...
متن کامل